Proof Transformations for Evolutionary Formal
نویسنده
چکیده
منابع مشابه
Transformations of specifications and proofs to support an evolutionary formal software development
Like other software engineering activities, formal modelling needs to deal with change: bugs and omissions need to be corrected, and changes from the outside need to be dealt with. In the context of axiomatic specifications and (partly) interactive proofs, the main obstacle is that changes invalidate proofs, which then need to be rebuilt using an inhibitive amount of resources. This thesis prop...
متن کاملLiterate Proving: Presenting and Documenting Formal Proofs
Literate proving is the analogue for literate programming in the mathematical realm. That is, the goal of literate proving is to produce clear expositions of formal mathematics that could even be enjoyable for people to read whilst remaining faithful representations of the actual proofs. This paper describes maze, a generic literate proving system. Authors markup formal proof files, such as Miz...
متن کاملRecursive turtle programs and iterated affine transformations
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing RTP ( a geometric interpretation of non-bracketed L-systems with a single production rule) and IAT (Iterated Function Systems restricted to affine transformations). Next, we provide a simple extension to RTP that gener...
متن کاملSynchrony Loosening Transformations for Interacting Processes
In this paper we consider synchrony loosening transformations (SLTs) for mnltiparty interactions. Refinement has been applied to several subjects. For example: Data Refinement: Replacing abstract data by more efiieient concrete representation e.g. [23], [5], Action Refinement: Replacing a complex action by a combination of simpler actions (a common refinement), Atomiciiy Refinement: [6]. While ...
متن کاملA Formal Proof Environment for UML / OCL
We present the theorem proving environment HOL-OCL that is integrated in a Model-driven Engineering (MDE) framework. HOL-OCL allows to reason over UML class models annotated with OCL specifications. Thus, HOL-OCL strengthens a crucial part of the UML to an objectoriented formal method. HOL-OCL provides several derived proof calculi that allow for formal derivations establishing the validity of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002